Neural-prior stochastic block model

نویسندگان

چکیده

Abstract The stochastic block model (SBM) is widely studied as a benchmark for graph clustering aka community detection. In practice, data often come with node attributes that bear additional information about the communities. Previous works modeled such by considering are generated from memberships. this work, motivated recent surge of in signal processing using deep neural networks priors, we propose to communities being determined rather than opposite. We define corresponding model; call it neural-prior SBM. an algorithm, stemming statistical physics, based on combination belief propagation and approximate message passing. analyze performance algorithm well Bayes-optimal performance. identify detectability exact recovery phase transitions, algorithmically hard region. proposed can be used both theory algorithms. To illustrate this, compare optimal performances simple networks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Partitiong in a Stochastic Block Model

In this lecture, we will perform a crude analysis of the performance of spectral partitioning algorithms in what are called stochastic block models or a planted partition model. The name you choose largely depends on your community and application. As we are especially interested today in partitioning, we will call it the planted partition model. In this model, we build a random graph that has ...

متن کامل

Node Features Adjusted Stochastic Block Model

Stochastic block model (SBM) and its variants are popular models used in community detection for network data. In this paper, we propose a feature adjusted stochastic block model (FASBM) to capture the impact of node features on the network links as well as to detect the residual community structure beyond that explained by the node features. The proposed model can accommodate multiple node fea...

متن کامل

Non-Reconstructability in the Stochastic Block Model

We consider the problem of clustering (or reconstruction) in the stochastic block model, in the regime where the average degree is constant. For the case of two clusters with equal sizes, recent results [MNS13, Mas14, MNS14] show that reconstructability undergoes a phase transition at the Kesten-Stigum bound of λ 2 d = 1, where λ2 is the second largest eigenvalue of a related stochastic matrix ...

متن کامل

Reconstruction in the Labeled Stochastic Block Model

The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two endpoints belong to the same community or not. It has been conjectured in [1] t...

متن کامل

A Neural Stochastic Volatility Model

In this paper, we show that the recent integration of statistical models with deep recurrent neural networks provides a new way of formulating volatility (the degree of variation of time series) models that have been widely used in time series analysis and prediction in finance. The model comprises a pair of complementary stochastic recurrent neural networks: the generative network models the j...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine learning: science and technology

سال: 2023

ISSN: ['2632-2153']

DOI: https://doi.org/10.1088/2632-2153/ace60f